#include <iostream>
#include "vector"
#include "map"
#include <unordered_map>
#include <stack>
#include <math.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <queue>
#include <cctype>
using namespace std;
struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Node
{
public:
    int val;
    Node *left;
    Node *right;
    Node *next;

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    Node(int _val, Node *_left, Node *_right, Node *_next)
        : val(_val), left(_left), right(_right), next(_next) {}
};

class huawei
{
public:
    int testhuawei()
    {
        // 100分试卷 10x2 10x4 5x8 从前往后做 错3个离场 问有多少种得分情况
        //回溯所有情况
        vector<int> vec;
        for (int i = 0; i < 10; ++i)
        {
            vec[i] = 2;
        }
        for (int i = 10; i < 20; ++i)
        {
            vec[i] = 4;
        }
        for (int i = 20; i < 28; ++i)
        {
            vec[i] = 8;
        }
        unorder_set
    }
};
int main()
{
    string s;
    getline(cin, s);
    cout << s;
    return 0;
}